Numerical simulation of probabilistic computing to NP-complete number theory problems

نویسندگان

چکیده

Probabilistic computing with p-bits is a powerful, unique paradigm alternative to classical and holds experimental advantages over certain forms of quantum computing. Stochastic nanodevices have been experimentally demonstrated act as artificial neurons in solving problems through probabilistic Still, many open questions about the breadth size soluble remain. We demonstrate capability made stochastic nanodevice network likely NP (non-deterministic polynomial time)-complete number theory associated combinatorial optimization, which can be implemented using optical parametric oscillators. These simulation results show robustness across all tested, great potential scale solve substantially larger problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Probabilistic Attack on NP-complete Problems

Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NPcomplete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries of its Hessian matrix equal to zero) intersects with a unit hypercube in many-dimensional Euclidean space. This connection suggests the possibility that meth...

متن کامل

Solving Numerical NP-Complete Problems with Spiking Neural P Systems

neural nets: Tissue P systems. In Proceedings of COCOON 2002, Singapore, LNCS 2387, Springer-Verlag, Berlin, 290–299. 15. M. Oswald. Independent agents in a globalized world modelled by tissue P systems. Conf. Artificial Life and Robotics, 2006. 16. Gh. Păun. Computing with Membranes. Journal of Computer and System Sciences, 61:108–143, 2000. See also Turku Centre for Computer Science — TUCS Re...

متن کامل

Quantum Computing, NP-complete Problems and Chaotic Dynamics

An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. We discuss a possible implementation of such a chaotic quantum computati...

متن کامل

Interpretations of the Quantum Theory and NP-Complete Problems

In this paper, we show that the satis ability problem (SAT, for short) can be solved by a quantum Turing machine in O(2 n 4 ) time under an assumption that a superposed physical states can be observed without collapsing the superposition, where n is the total length of the description of an input logical formula f and the description of the number of variables in f . Furthermore, we show that a...

متن کامل

Splitting Number is NP-complete

We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of a graph and the size of a maximum planar subgraph. The splitting number of a graph G is the smallest integer k 0, such that a planar graph can be obtained from G by k splitting operations. Such operation replaces a vertex v by two nonadjacent vertices v1 and v2, and attaches the neighbors of v e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Photonics for Energy

سال: 2023

ISSN: ['1947-7988']

DOI: https://doi.org/10.1117/1.jpe.13.028501